Computing the Fréchet distance between two polygonal curves
نویسندگان
چکیده
Computing the Fréchet distance between two polygonal curves H Alt, M Godau International Journal of Computational Geometry & ..., 1995 World Scientific As a measure for the resemblance of curves in arbitrary dimensions we consider the socalled Fréchet-distance, which is compatible with parametrizations of the curves. For polygonal chains P and Q consisting of p and q edges an algorithm of runtime O (pq log ( ... Cited by 384 Related articles All 5 versions Web of Science: 129 Cite Save More
منابع مشابه
How Difficult is it to Walk the Dog?
We study the complexity of computing the Fréchet distance (also called dog-leash distance) between two polygonal curves with a total number of n vertices. For two polygonal curves in the plane we prove an Ω(n log n) lower bound for the decision problem in the algebraic computation tree model allowing arithmetic operations and tests. Up to now only a O(n) upper bound for the decision problem was...
متن کاملFréchet distance with speed limits
In this paper, we introduce a new generalization of the well-known Fréchet distance between two polygonal curves, and provide an efficient algorithm for computing it. The classical Fréchet distance between two polygonal curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-negative speeds. Here, we consider a problem instance in which t...
متن کاملApplied Similarity Problems Using Frechet Distance
The Fréchet distance is a well-known metric to measure similarity of polygonal curves. In the first part of this thesis, we introduce a new metric called Fréchet distance with speed limits and provide efficient algorithms for computing it. The classical Fréchet distance between two curves corresponds to the maximum distance between two point objects that traverse the curves with arbitrary non-n...
متن کاملComputing Discrete Fréchet Distance
The Fréchet distance between two curves in a metric space is a measure of the similarity between the curves. We present a discrete variation of this measure. It provides good approximations of the continuous measure and can be efficiently computed using a simple algorithm. We also consider variants of discrete Fréchet distance, and find an interesting connection to measuring distance between th...
متن کاملComputing Fréchet Distance with Speed Limits
In this paper, we study a problem on computing the Fréchet distance between two polygonal curves and provide efficient solutions for solving it. In the classical Fréchet distance, point objects move arbitrarily fast on the polygonal curves. Here, we consider the problem instance where the speed per segment is a constant within a specified range. We first describe a naive algorithm which solves ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 5 شماره
صفحات -
تاریخ انتشار 1995